Base | Representation |
---|---|
bin | 10111001110011010010100… |
… | …010111011010111111101001 |
3 | 111101200000010122112212122202 |
4 | 113032122110113122333221 |
5 | 101342022240224320241 |
6 | 1001124541040225545 |
7 | 30341522161153325 |
oct | 2716322427327751 |
9 | 441600118485582 |
10 | 102145401401321 |
11 | 2a601692190933 |
12 | b55856830b2b5 |
13 | 44cc368310255 |
14 | 1b31c143dc985 |
15 | bc20827b3d9b |
hex | 5ce6945dafe9 |
102145401401321 has 16 divisors (see below), whose sum is σ = 103327759417344. Its totient is φ = 100969223788944.
The previous prime is 102145401401311. The next prime is 102145401401371. The reversal of 102145401401321 is 123104104541201.
It is a cyclic number.
It is not a de Polignac number, because 102145401401321 - 226 = 102145334292457 is a prime.
It is a super-2 number, since 2×1021454014013212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102145401401311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93929726 + ... + 95010968.
It is an arithmetic number, because the mean of its divisors is an integer number (6457984963584).
Almost surely, 2102145401401321 is an apocalyptic number.
It is an amenable number.
102145401401321 is a deficient number, since it is larger than the sum of its proper divisors (1182358016023).
102145401401321 is a wasteful number, since it uses less digits than its factorization.
102145401401321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1084100.
The product of its (nonzero) digits is 3840, while the sum is 29.
Adding to 102145401401321 its reverse (123104104541201), we get a palindrome (225249505942522).
The spelling of 102145401401321 in words is "one hundred two trillion, one hundred forty-five billion, four hundred one million, four hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •