Base | Representation |
---|---|
bin | 10111100000110101111100… |
… | …010111001000000000000111 |
3 | 111120011002111001122202112222 |
4 | 113200311330113020000013 |
5 | 102023300301042211123 |
6 | 1003534453504402555 |
7 | 30532162052616443 |
oct | 2740657427100007 |
9 | 446132431582488 |
10 | 103412014022663 |
11 | 2aa4a874a742a5 |
12 | b721b3631645b |
13 | 4591932318518 |
14 | 1b7724d6d9823 |
15 | be4eb54ec6c8 |
hex | 5e0d7c5c8007 |
103412014022663 has 2 divisors, whose sum is σ = 103412014022664. Its totient is φ = 103412014022662.
The previous prime is 103412014022651. The next prime is 103412014022689. The reversal of 103412014022663 is 366220410214301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103412014022663 - 26 = 103412014022599 is a prime.
It is a super-2 number, since 2×1034120140226632 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103412014022693) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51706007011331 + 51706007011332.
It is an arithmetic number, because the mean of its divisors is an integer number (51706007011332).
Almost surely, 2103412014022663 is an apocalyptic number.
103412014022663 is a deficient number, since it is larger than the sum of its proper divisors (1).
103412014022663 is an equidigital number, since it uses as much as digits as its factorization.
103412014022663 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 35.
Adding to 103412014022663 its reverse (366220410214301), we get a palindrome (469632424236964).
The spelling of 103412014022663 in words is "one hundred three trillion, four hundred twelve billion, fourteen million, twenty-two thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •