Base | Representation |
---|---|
bin | 100100011111110000000011… |
… | …0001111111100000000000011 |
3 | 1120002122111211121121022121122 |
4 | 1020333200012033330000003 |
5 | 314034120342421212233 |
6 | 3054431554512142455 |
7 | 124422104453522156 |
oct | 11077400617740003 |
9 | 1502574747538548 |
10 | 321023140413443 |
11 | 93319170786586 |
12 | 30008528237a2b |
13 | 10a18476b66b00 |
14 | 593b8624d9c9d |
15 | 271a836754d98 |
hex | 123f8063fc003 |
321023140413443 has 24 divisors (see below), whose sum is σ = 347808481509888. Its totient is φ = 296165650296672.
The previous prime is 321023140413433. The next prime is 321023140413593. The reversal of 321023140413443 is 344314041320123.
It is not a de Polignac number, because 321023140413443 - 212 = 321023140409347 is a prime.
It is a super-2 number, since 2×3210231404134432 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (321023140413433) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7183792646 + ... + 7183837332.
It is an arithmetic number, because the mean of its divisors is an integer number (14492020062912).
Almost surely, 2321023140413443 is an apocalyptic number.
321023140413443 is a deficient number, since it is larger than the sum of its proper divisors (26785341096445).
321023140413443 is a wasteful number, since it uses less digits than its factorization.
321023140413443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67203 (or 67190 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 321023140413443 its reverse (344314041320123), we get a palindrome (665337181733566).
The spelling of 321023140413443 in words is "three hundred twenty-one trillion, twenty-three billion, one hundred forty million, four hundred thirteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •