Base | Representation |
---|---|
bin | 1001101011101001010011… |
… | …0110011100100001001010 |
3 | 1101200200201001121102020020 |
4 | 2122322110312130201022 |
5 | 2343403313110310132 |
6 | 34350235153441310 |
7 | 2146051405133250 |
oct | 232722466344112 |
9 | 41620631542206 |
10 | 10645426260042 |
11 | 3434777664092 |
12 | 123b1a3870236 |
13 | 5c2b23101032 |
14 | 28b3544c05d0 |
15 | 136da2d4d52c |
hex | 9ae94d9c84a |
10645426260042 has 16 divisors (see below), whose sum is σ = 24332402880192. Its totient is φ = 3041550360000.
The previous prime is 10645426259999. The next prime is 10645426260067. The reversal of 10645426260042 is 24006262454601.
It is a super-2 number, since 2×106454262600422 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 253462530001 = 10645426260042 / (1 + 0 + 6 + 4 + 5 + 4 + 2 + 6 + 2 + 6 + 0 + 0 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 10645426259976 and 10645426260003.
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, 126731264959 + ... + 126731265042.
It is an arithmetic number, because the mean of its divisors is an integer number (1520775180012).
Almost surely, 210645426260042 is an apocalyptic number.
10645426260042 is an abundant number, since it is smaller than the sum of its proper divisors (13686976620150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10645426260042 is a wasteful number, since it uses less digits than its factorization.
10645426260042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253462530013.
The product of its (nonzero) digits is 552960, while the sum is 42.
The spelling of 10645426260042 in words is "ten trillion, six hundred forty-five billion, four hundred twenty-six million, two hundred sixty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •