Base | Representation |
---|---|
bin | 101111101100110010… |
… | …0100111101001000010 |
3 | 100210101211120220212011 |
4 | 1133121210213221002 |
5 | 3134241213100414 |
6 | 115020250523134 |
7 | 10254264624400 |
oct | 1373144475102 |
9 | 323354526764 |
10 | 102434503234 |
11 | 3a495674448 |
12 | 17a291364aa |
13 | 9875cb8cbb |
14 | 4d5a502470 |
15 | 29e7d28dc4 |
hex | 17d9927a42 |
102434503234 has 48 divisors (see below), whose sum is σ = 184649794560. Its totient is φ = 42450670080.
The previous prime is 102434503231. The next prime is 102434503247. The reversal of 102434503234 is 432305434201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 102434503196 and 102434503205.
It is not an unprimeable number, because it can be changed into a prime (102434503231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4018722 + ... + 4044130.
It is an arithmetic number, because the mean of its divisors is an integer number (3846870720).
Almost surely, 2102434503234 is an apocalyptic number.
102434503234 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
102434503234 is a deficient number, since it is larger than the sum of its proper divisors (82215291326).
102434503234 is a wasteful number, since it uses less digits than its factorization.
102434503234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26783 (or 26776 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 31.
Adding to 102434503234 its reverse (432305434201), we get a palindrome (534739937435).
The spelling of 102434503234 in words is "one hundred two billion, four hundred thirty-four million, five hundred three thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •