Base | Representation |
---|---|
bin | 10110101000110110100… |
… | …001110111110111100001 |
3 | 12111201111220212012110111 |
4 | 112220312201313313201 |
5 | 200442024402313101 |
6 | 3150401524131321 |
7 | 220252344256165 |
oct | 26506641676741 |
9 | 5451456765414 |
10 | 1555693010401 |
11 | 54a847169412 |
12 | 211606536b41 |
13 | b3916777a2a |
14 | 554200d6ca5 |
15 | 2a701937251 |
hex | 16a36877de1 |
1555693010401 has 32 divisors (see below), whose sum is σ = 1702149120000. Its totient is φ = 1415986790400.
The previous prime is 1555693010357. The next prime is 1555693010411. The reversal of 1555693010401 is 1040103965551.
It is a cyclic number.
It is not a de Polignac number, because 1555693010401 - 217 = 1555692879329 is a prime.
It is a super-2 number, since 2×15556930104012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1555693010411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 110553196 + ... + 110567266.
It is an arithmetic number, because the mean of its divisors is an integer number (53192160000).
Almost surely, 21555693010401 is an apocalyptic number.
It is an amenable number.
1555693010401 is a deficient number, since it is larger than the sum of its proper divisors (146456109599).
1555693010401 is a wasteful number, since it uses less digits than its factorization.
1555693010401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15505.
The product of its (nonzero) digits is 81000, while the sum is 40.
Adding to 1555693010401 its reverse (1040103965551), we get a palindrome (2595796975952).
The spelling of 1555693010401 in words is "one trillion, five hundred fifty-five billion, six hundred ninety-three million, ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •