Base | Representation |
---|---|
bin | 1001110010001001010110… |
… | …01001001000110010100111 |
3 | 2211011201221122010112020021 |
4 | 10321010223021020302213 |
5 | 10304442103020020010 |
6 | 113431254404420011 |
7 | 4350231206122534 |
oct | 471045311106247 |
9 | 84151848115207 |
10 | 21514215001255 |
11 | 6945144548249 |
12 | 24b57230a7607 |
13 | c00a21716592 |
14 | 545417769d8b |
15 | 27497a1828da |
hex | 13912b248ca7 |
21514215001255 has 8 divisors (see below), whose sum is σ = 25829973000000. Its totient is φ = 17202762002016.
The previous prime is 21514215001219. The next prime is 21514215001303. The reversal of 21514215001255 is 55210051241512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21514215001255 - 243 = 12718121979047 is a prime.
It is a super-2 number, since 2×215142150012552 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21514215001255.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1076238880 + ... + 1076258869.
It is an arithmetic number, because the mean of its divisors is an integer number (3228746625000).
Almost surely, 221514215001255 is an apocalyptic number.
21514215001255 is a deficient number, since it is larger than the sum of its proper divisors (4315757998745).
21514215001255 is a wasteful number, since it uses less digits than its factorization.
21514215001255 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2152499753.
The product of its (nonzero) digits is 20000, while the sum is 34.
Adding to 21514215001255 its reverse (55210051241512), we get a palindrome (76724266242767).
The spelling of 21514215001255 in words is "twenty-one trillion, five hundred fourteen billion, two hundred fifteen million, one thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •